Reconstruction of graphs via asymmetry

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is representative of a graph asymmetry, the reconstruction of that graph reduces to a smaller form of the reconstruction. Therefore, to show that a graph is reconstructible, it is sufficient to find a suitable anchor that brings us to a solved form of the problem. Let G be an arbitrary graph with n vertices which is not vertex-transitive. Usually, graph G has either a (n − 2)-vertex anchor H or an orbit O with at least three vertices such that G\O is an anchor (or connective anchor) and it enables us to show that graph G is reconstructible. For instance, this fact is enough to show that trees are reconstructible.